Restricted Detour Polynomial of a Straight Chain of Wheel Graphs
نویسندگان
چکیده
Restricted detour distance between two vertices and of a graph is the length longest u- v path for induced condition (V (P))=P. The restricted polynomial depends on denoted by D*(G,x) defined = ∑{u,v}xD*(u,v) where summation taken over all unordered pairs (u,v) distinct u V(G). In this paper, we investigate straight chain wheel graphs φ(WkB) compute index φ(WkB).
منابع مشابه
Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملOn edge detour graphs
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملNontraceable detour graphs
The detour order (of a vertex v) of a graph G is the order of a longest path (beginning at v). The detour sequence of G is a sequence consisting of the detour orders of its vertices. A graph is called a detour graph if its detour sequence is constant. The detour deficiency of a graph G is the difference between the order of G and its detour order. Homogeneously traceable graphs are therefore de...
متن کاملa comparison of linguistic and pragmatic knowledge: a case of iranian learners of english
در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ma?alla? al-r?fidayn li-?ul?m al-??sib?t wa-al-riy??iyy??
سال: 2023
ISSN: ['1815-4816', '2311-7990']
DOI: https://doi.org/10.33899/csmj.2023.179505